Iteration Methods for Linear Systems with Positive Definite Matrix
نویسندگان
چکیده
منابع مشابه
Positive Definite and Semi-definite Splitting Methods for Non-hermitian Positive Definite Linear Systems
In this paper, we further generalize the technique for constructing the normal (or positive definite) and skew-Hermitian splitting iteration method for solving large sparse nonHermitian positive definite system of linear equations. By introducing a new splitting, we establish a class of efficient iteration methods, called positive definite and semi-definite splitting (PPS) methods, and prove th...
متن کاملOn the modified iterative methods for $M$-matrix linear systems
This paper deals with scrutinizing the convergence properties of iterative methods to solve linear system of equations. Recently, several types of the preconditioners have been applied for ameliorating the rate of convergence of the Accelerated Overrelaxation (AOR) method. In this paper, we study the applicability of a general class of the preconditioned iterative methods under certain conditio...
متن کاملaccelerated normal and skew-hermitian splitting methods for positive definite linear systems
for solving large sparse non-hermitian positive definite linear equations, bai et al. proposed the hermitian and skew-hermitian splitting methods (hss). they recently generalized this technique to the normal and skew-hermitian splitting methods (nss). in this paper, we present an accelerated normal and skew-hermitian splitting methods (anss) which involve two parameters for the nss iteration. w...
متن کاملAn Incomplete Factorization Technique for Positive Definite Linear Systems
This paper describes a technique for solving the large sparse symmetric linear systems that arise from the application of finite element methods. The technique combines an incomplete factorization method called the shifted incomplete Cholesky factorization with the method of generalized conjugate gradients. The shifted incomplete Cholesky factorization produces a splitting of the matrix A that ...
متن کاملParallel Numerical Algorithms for Symmetric Positive Definite Linear Systems
We give a matrix factorization for the solution of the linear system Ax = f , when coefficient matrix A is a dense symmetric positive definite matrix. We call this factorization as "WW T factorization". The algorithm for this factorization is given. Existence and backward error analysis of the method are given. The WDWT factorization is also presented. When the coefficient matrix is a symmetric...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: TELKOMNIKA (Telecommunication Computing Electronics and Control)
سال: 2016
ISSN: 2302-9293,1693-6930
DOI: 10.12928/telkomnika.v14i4.4238